A Quadratic Running Time Example for Ruppert’s Refinement Algorithm
نویسندگان
چکیده
We present an example where Ruppert’s refinement algorithm for quality 2D Delaunay mesh generation runs in time quadratic in the size of the output mesh. For any n > 1, input and output mesh sizes of our example are Θ(n), the bounding box dimensions are 1×Θ(n), and the algorithm running time is Θ(n). Because Θ(n) is a theoretical upper bound on the running time of Ruppert’s refinement algorithm, our example is tight.
منابع مشابه
Reordering Ruppert’s Algorithm
Ruppert’s algorithm [6] is an elegant method for generating size-competitive meshes, but admits a poor worst case run-time. Recent time-efficient Delaunay refinement algorithms [2] rely on bounding the the degree of each intermediate triangulation and thus ensure that all local operations in the Delaunay triangulation are efficient. We propose a simple alternative to Ruppert’s algorithm which m...
متن کاملWhere and How Chew's Second Delaunay Refinement Algorithm Works
Chew’s second Delaunay refinement algorithm with offcenter Steiner vertices leads to practical improvement over Ruppert’s algorithm for quality mesh generation, but the most thorough theoretical analysis is known only for Ruppert’s algorithm. A detailed analysis of Chew’s second Delaunay refinement algorithm with offcenters is given, improving the guarantee of well-graded output for any minimum...
متن کاملOn the Non-Termination of Ruppert's Algorithm
A planar straight-line graph which causes the non-termination Ruppert’s algorithm for a minimum angle threshold α ' 29.5 is given. The minimum input angle of this example is about 74.5 meaning that failure is not due to small input angles. Additionally, a similar non-acute input is given for which Chew’s second algorithm does not terminate for a minimum angle threshold α ' 30.7. For a non-acute...
متن کاملDelaunay refinement for curved complexes
This work investigates the Delaunay refinement for curved complexes. A manifold complex is defined as an unambiguous representation for the geometric objects required by a partial differential equation solver. The Chew’s and Ruppert’s Delaunay refinement algorithms, including an extension for curved complexes, are described under a new and arbitrary dimensional perspective. A theorem for strong...
متن کاملAbout One Sweep Algorithm for Solving Linear-Quadratic Optimization Problem with Unseparated Two-Point Boundary Conditions
In the paper a linear-quadratic optimization problem (LCTOR) with unseparated two-point boundary conditions is considered. To solve this problem is proposed a new sweep algorithm which increases doubles the dimension of the original system. In contrast to the well-known methods, here it refuses to solve linear matrix and nonlinear Riccati equations, since the solution of such multi-point optimi...
متن کامل